The Dynamics of Closeness and Betweenness
نویسندگان
چکیده
Although both betweenness and closeness centrality are claimed to be important for the effectiveness of someone’s network position, it has not been explicitly studied which networks emerge if actors follow incentives for these two positional advantages. We propose such a model and observe that network dynamics differ considerably in a scenario with either betweenness or closeness incentives compared to a scenario in which closeness and betweenness incentives are combined. Considering social consequences, we find low clustering when actors strive for either type of centrality. Surprisingly, actors striving for closeness are likely to reach networks with relatively low closeness and high betweenness, while this is the other way round for actors striving for betweenness. This shows that in both situations the network formation process implies a social dilemma in which the social optimum is not reached by individual optimizing.
منابع مشابه
A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملAnalyzing the Collaboration Network of Global Scientific Outputs in the Field of Bibliotherapy in the Web of Science Database
Background and Aim: Bibliotherapy is a useful treatment for the prevention and treatment of mental disorders and has led to the formation of many scientific publications in this field. The purpose of this study was to investigate the publication trends in the field of bibliotherapy and visualize the structure of its scientific collaborations based on the Web of Science database during the perio...
متن کاملReal Time Closeness and Betweenness Centrality Calculations on Streaming Network Data
Closeness and betweenness are among the most important metrics in social network analysis. They are essential to the evaluation of various research problems such as viral marketing, network stability and network traffic predictions, which play an important role in social media research. However, both of these metrics are expensive to compute. We propose an efficient online algorithm framework t...
متن کاملA Graph Manipulations for Fast Centrality Computation
The betweenness and closeness metrics are widely used metrics in many network analysis applications. Yet, they are expensive to compute. For that reason, making the betweenness and closeness centrality computations faster is an important and well-studied problem. In this work, we propose the framework BADIOS which manipulates the graph by compressing it and splitting into pieces so that the cen...
متن کاملThe Parameterized Complexity of Centrality Improvement in Networks
The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applications, as a higher centrality often implies a larger impact on the network or less transportation or administration cost. In this work we study the parameterized complexity of the NP-complete problems Closeness Impro...
متن کامل